Bounding Inconsistency Using a Novel Threshold Metric for Dead Reckoning Update Packet Generation
نویسندگان
چکیده
Human-to-human interaction across distributed applications requires that sufficient consistency be maintained among participants in the face of network characteristics such as latency and limited bandwidth. The level of inconsistency arising from the network is proportional to the network delay, and thus a function of bandwidth consumption. Distributed simulation has often used a bandwidth reduction technique known as dead reckoning that combines approximation and estimation in the communication of entity movement to reduce network traffic, and thus improve consistency. However, unless carefully tuned to application and network characteristics, such an approach can introduce more inconsistency than it avoids. The key tuning metric is the distance threshold. This paper questions the suitability of the standard distance threshold as a metric for use in the dead reckoning scheme. Using a model relating entity path curvature and inconsistency, a major performance related limitation of the distance threshold technique is highlighted. We then propose an alternative time–space threshold criterion. The time–space threshold is demonstrated, through simulation, to perform better for low curvature movement. However, it too has a limitation. Based on this, we further propose a novel hybrid scheme. Through simulation and live trials, this scheme is shown to perform well across a range of curvature values, and places bounds on both the spatial and absolute inconsistency arising from dead reckoning.
منابع مشابه
A Physics-Aware Dead Reckoning Technique for Entity State Updates in Distributed Interactive Applications
This paper proposes a novel entity state update technique for physics-rich environments in peer-to-peer Distributed Interactive Applications. The proposed technique consists of a dynamic authority scheme for shared objects and a physics-aware dead reckoning model with an adaptive error threshold. The former is employed to place a bound on the overall inconsistency present in shared objects, whi...
متن کاملKalman Filter Based Dead Reckoning Algorithm for Minimizing Network Traffic Between Mobile Nodes in Wireless GRID
Conventional GRID service is static (no mobility), and it has many drawbacks such as continuous connection, waste of bandwidth, and service overloading. Wireless GRID supports mobility, however it should consider geographic position to support efficient resource sharing and routing. When the devices in the GRID are highly mobile, there will be much traffic to exchange the geographic position in...
متن کاملOn Reducing Entity State Update Packets in Distributed Interactive Simulations using a Hybrid Model
A key component in Distributed Interactive Simulations (DIS) is the number of data packets transmitted across the connected networks. To reduce the number of packets transmitted, DIS applications employ client-side predictive contracts. One widespread client-side predictive contract technique is dead reckoning. This paper proposes a hybrid predictive contract technique, which chooses either the...
متن کاملModelling of Dead Reckoning and Heartbeat Update Mechanisms in Distributed Interactive Simulation
Dead reckoning is employed in Advanced Distributed Simulation exercises to reduce the need to continually update a simulated entity’s state information. The IEEE Distributed Interactive Simulation (DIS) protocol provides a standard set of 11 algorithms for entity position and orientation dead reckoning. Related to dead reckoning is the heartbeat mechanism used to periodically define the current...
متن کاملB-S LEE et al: ADAPTIVE DEAD RECKONING ADAPTIVE DEAD RECKONING ALGORITHMS FOR DISTRIBUTED INTERACTIVE SIMULATION
This paper describes two adaptive algorithms for dead reckoning in Distributed Interactive Simulation (DIS). The first algorithm is based on the control mechanism of adaptive adjustment of threshold level and the second on automatic selection of extrapolation equation. Since a fixed threshold cannot adequately handle the dynamic relationships between moving entities, a multi-level threshold sch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Simulation
دوره 84 شماره
صفحات -
تاریخ انتشار 2008